top dk queri evalu sensor network queri respons time constraint keyword search databas advanc knowledg discoveri data mine advanc knowledg discoveri data mine databas xml technolog intern xml databas symposium match depend drelat queri system depend graph energi deffici top dk queri process wireless sensor network match top dk answer twig pattern probabilist xml discov burst area fast evolv graph chase tree pattern recurs dtd detect leader correl time seri fire web effici explor histor web graph queri larg graph databas graph power model tool graph data chemistri biologi imag vision social network web queri larg graph databas graph power model tool graph data chemistri biologi imag vision social network web probabilist rank relat research geograph inform share cultur background onlin time interv top dk queri wireless sensor network fast singl dpair simrank comput find maxim cliqu massiv network dgraph maxim cliqu enumer mce fundament problem graph theori import applic area social network analysi bioinformat problem extens studi exist algorithm requir memori space linear size input graph concern view massiv volum todai fastgrow network graph mce requir random access part larg graph difficult divid graph smaller part process part time result incorrect incomplet incur huge cost merg result part propos notion graph defin core network extend encompass neighborhood core mce comput propos extern memori algorithm mce extmc theh graph bound memori usag prove correct complet result comput extmc extens experi verifi extmc effici process larg network fit memori show graph captur import properti network updat maxim cliqu graph retain essenti inform low updat cost infeas perform updat entir network connect substructur similar search maxim contain rewrit tree pattern queri view duplic dinsensit order statist comput data stream abstract duplic data stream observ project subspac multipl record object uniqu assumpt observ data element convent aggreg comput problem investig due duplic sensit natur paper present space effici scan algorithm continu maintain duplic insensit order sketch rank base queri approxim process rel rank error guarante presenc data duplic space effici propos algorithm time effici highli accur techniqu immedi appli heavi hitter problem distinct element exist fault toler distribut commun techniqu comprehens perform studi demonstr algorithm support real time comput high speed data stream keyword search relat databas survei integr db ir flexibl wai user queri inform platform hand sophist db facil provid rdbmss assist user queri structur inform sql hand ir techniqu user search unstructur inform keyword base score rank user understand databas schema duplic dinsensit order statist comput data stream abstract duplic data stream observ project subspac multipl record object uniqu assumpt observ data element convent aggreg comput problem investig due duplic sensit natur paper present space effici scan algorithm continu maintain duplic insensit order sketch rank base queri approxim process rel rank error guarante presenc data duplic space effici propos algorithm time effici highli accur techniqu immedi appli heavi hitter problem distinct element exist fault toler distribut commun techniqu comprehens perform studi demonstr algorithm support real time comput high speed data stream guest editor introduct special section mine larg uncertain probabilist databas adapt relax queri heterogen xml data sourc context dsensit document rank igraph framework comparison disk dbase graph index techniqu graph grow import model complex structur chemic compound protein imag program depend queri graph subgraph isomorph problem find set graph graph databas np complet recent lot research effort solv subgraph isomorph problem larg graph databas util graph index graph index filter prune graph real answer inexpens cost expens subgraph isomorph test verifi filter candid number disk os subgraph isomorph test significantli minim current practic experi graph index techniqu author newli propos techniqu implement exist index code base origin author binari execut report wall clock time observ practic result problem order address problem made signific effort implement repres index method common framework call igraph unlik exist implement full partial memori represent reli os file system cach guarante real disk os implement index top storag engin guarante real disk os extens experi synthet real dataset provid empir find perform full disk base implement method slide dwindow top dk queri uncertain stream queri process uncertain data stream attract lot attent due imprecis natur data gener varieti stream applic read sensor network exist work uncertain data stream studi unbound stream paper take step import challeng problem answer slide window queri uncertain data stream focu arguabl import type queri top queri challeng answer slide window top queri uncertain data stream stem strict space time requir process arriv expir tupl high speed stream combin difficulti cope exponenti blowup number world induc uncertain data model paper design unifi framework process slide window top queri uncertain stream show exist top definit literatur plug framework result succinct synops space smaller window size highli effici term process time addit theoret space time bound prove synops present experiment report verifi practic effici synthet real data icdm workshop web inform system engin wise index function effici algorithm multi ddimension search expens distanc function minim common contain tree pattern progress skylin queri evalu mainten wireless sensor network context dsensit document rank uniform framework ad dhoc index answer reachabl queri larg graph materi view select xml databas find influenc set skylin set product set custom product bichromat revers skylin queri retriev custom find product absolut specif custom revers skylin product match prefer dimens exist bichromat revers skylin algorithm refer basic design uncertain data paper focus tradit dataset object precis point precis point regard special uncertain object basic appli precis data inher easier handl uncertain data expect basic improv take advantag reduc problem complex observ trivial heurist optim access order achiev stronger prune power motiv propos algorithm call br prove br entail os basic theoret analysi perform extens experi show practic br outperform basic larg factor follow anti correl distribut br faster basic order magnitud final address variat bichromat revers skylin search convent definit dynam skylin longer make sens dline exact shortest distanc queri process probabilist skylin oper slide window abstract skylin comput applic includ multi criteria decis make paper studi problem effici process continu skylin queri slide window uncertain data element probabl threshold character kind element queri comput show size dynam maintain candid set size skylin develop effici techniqu process continu probabilist skylin queri final extend techniqu applic multipl probabl threshold retriev top skylin data object extens experi demonstr propos techniqu effici handl high speed data stream real time scalabl keyword search larg data stream spatial rang queri gaussian dbase imprecis queri object queri commun relat databas abstract keyword search relat databas user insight easili observ tradit rdbm techniqu keyword queri set keyword kl find tupl keyword connect relat databas foreign kei refer conceptu find structur inform databas graph node tupl edg foreign kei refer exist work studi find connect tree keyword queri tree show partial inform tupl keyword connect paper focu find commun keyword queri commun induc subgraph keyword distanc propos effici algorithm find top commun consum small memori keyword queri topk keyword queri algorithm user interact enlarg run time conduct extens perform studi larg real dataset confirm effici algorithm context dawar object connect discoveri larg graph topic distribut link web abstract web user creat link intent kei question studi categor link quantifi strength influenc web page link link web page paper focu problem link semant analysi propos supervis learn approach build model base train link label link weight graph link label repres categori link link weight repres influenc web page link base model built categor link quantifi influenc web page larg graph applic domain discuss propos approach pairwis restrict boltzmann machin prbm conduct extens experiment studi demonstr effect approach larg real dataset effici discoveri frequent correl subgraph pair recent prolifer graph data wide spectrum applic led increas demand advanc data analysi techniqu view graph mine techniqu frequent subgraph mine correl subgraph mine propos applic frequenc correl plai import role paper studi problem mine set frequent correl subgraph pair simpl algorithm combin exist algorithm mine frequent subgraph correl subgraph result multipl mine oper major redund discov graph correl common graph highli correl establish theoret foundat find deriv tight lower bound correl graph correl common graph theoret result lead design effect skip mechan skip process major graph mine process algorithm fcp miner fast approxim algorithm show miss pair small set margin correl pair extens experi verifi effici effect fcp miner find hidden structur relat databas top dk correl graph mine monitor path nearest neighbor road network paper address problem monitor nearest neighbor dynam chang path road network destin user queri return nn respect shortest path connect destin user current locat list nearest candid refer come journei queri path nearest neighbor queri pnn user move follow shortest path queri path chang challeng monitor pnn arbitrarili move user dynam determin updat locat refresh pnn effici propos phase network expans bne algorithm monitor pnn shortest path search phase bne find shortest path destin candid set guarante includ pnn gener time verif phase heurist algorithm run examin candid exact distanc queri path achiev signific reduct number visit node monitor phase deal comput updat locat refresh pnn user movement determin network distanc costli process expans tree candid set carefulli maintain bne algorithm provid effici updat shortest path pnn result final conduct extens experi real road network show method achiev satisfactori perform keyword search databas power rdbm microbenchmark multimedia data buffer multimedia server report literatur design serv multipl independ video audio stream futur multimedia server serv complet present multimedia present provid uniqu opportun develop algorithm buffer manag admiss control execut time consumpt requir present priori paper examin present domain heavyweight middleweight lightweight provid buffer manag admiss control algorithm domain propos improv flatten dynam adjust schedul creat heavyweight present result simul environ present keyword multimedia present buffer manag admiss control flatten multimedia data storag protect multimedia data malici comput user continu grow import prevent unauthor access digit photograph ensur complianc copyright regul guarante integr video teleconfer multimedia applic requir increas secur presenc talent intrud specif file preserv disk requir provid secur storag import paper present survei techniqu secur store multimedia data includ theoret approach prototyp system exist system readi employ due wide varieti potenti solut prospect custom easili overwhelm research system multimedia requir ad secur measur inevit result slower system perform storag solut provid fit applic secur perform continuum paper overview promin characterist system provid foundat select solut initi paper establish set criteria evalu storag solut base confidenti integr avail perform criteria paper explain relev characterist select storag system provid comparison major differ final paper examin specif applic storag devic multimedia environ multimedia resourc schedul xml benchmark standard effort queri languag xml document draw close research user increasingli focu attent databas technolog deliv challeng sheer amount xml document produc applic pose data manag valid perform evalu optim xml queri processor upcom issu long tradit databas research xml store benchmark project framework assess xml databas abil cope broad spectrum queri typic pose real world applic scenario benchmark intend implementor user compar xml databas independ specif applic scenario continu multimedia data retriev applic benchmark fast probabilist rank drelat model multiscal represent fast pattern match stream time seri stock predict event ddriven approach base bursti keyword multiscal represent fast pattern match stream time seri make filter smart distribut data stream environ graph cluster base structur fattribut similar goal graph cluster partit vertic larg graph cluster base criteria vertex connect neighborhood similar graph cluster techniqu detect dens connect group larg graph exist graph cluster method focu topolog structur cluster larg ignor vertex properti heterogen paper propos graph cluster algorithm sa cluster base structur attribut similar unifi distanc measur method partit larg graph attribut cluster cluster dens connect subgraph homogen attribut valu effect method propos automat learn degre contribut structur similar attribut similar theoret analysi provid show sa cluster converg extens experiment result demonstr effect sa cluster comparison state art graph cluster summar method queri translat xpath sql presenc recurs dtd interact recurs xpath recurs dtd make challeng answer xpath queri xml data store rdbm schema base shred present approach translat xpath queri sql queri simpl fixpoint lfp oper support commerci rdbm approach base algorithm rewrit xpath queri regular xpath express capabl captur dtd recurs xpath queri uniform framework provid algorithm translat regular xpath queri sql queri lfp optim techniqu minim lfp oper optim updat recurs xml view relat independ pattern properti applic tree pattern queri rewrit view semant base buffer reduct queri xml data stream comput structur similar sourc xml schema domain xml schema paper studi problem measur structur similar larg number sourc schema singl domain schema enhanc qualiti search rank big volum sourc document web structur inform analyz improp adopt exist edit distanc base method propos similar measur model cater requir problem asymmetr natur similar comparison sourc schema domain schema similar preserv rule algorithm design filter uninterest element sourc schema purpos optim similar comput base model basic algorithm improv algorithm develop structur similar comput improv algorithm make full code scheme devis reduc number comparison complex algorithm analyz extens experi conduct show signific perform gain achiev improv algorithm safeti comput local properti web queri mine multipl time seri dmovement energi deffici skylin queri process mainten sensor network effici top dk search heterogen xml data sourc support keyword queri structur databas limit search interfac holist algorithm effici evalu xtwig join xpath rewrit multipl view standard approach optim xpath queri rewrit view techniqu consist navig insid view output allow usag view rewritten queri algorithm richer class xpath rewrit intersect join node identifi propos lack complet guarante requir addit inform data identifi tightest restrict xpath rewritten polynomi time intersect view propos algorithm work document type identifi addit contribut analyz complex relat problem decid xpath intersect equival rewritten intersect union transform tree pattern dtd queri contain test spectral code larg graph databas retriev relat graph queri graph larg graph databas kei issu graph base applic drug discoveri structur pattern recognit graph isomorph np complet problem emploi filter verif framework speed search effici effect effici prune strategi filter fals posit graph result valid remain candid subgraph isomorph check paper propos filter method spectral encod method gcode specif assign signatur vertex base local structur gener spectral graph code combin vertex signatur graph base spectral graph code deriv condit graph isomorph propos prune rule graph search problem prove satisfi fals neg requir dismiss answer graph code numer space advantag conduct effici filter graph code extens experi show gcode outperform exist counterpart method fast comput reachabl label larg graph high compress rate numer applic deal larg graph queri reachabl node graph hop cover compactli repres edg transit closur graph space answer reachabl queri effici challeng comput hop cover exist approach suffer larg resourc consumpt low compress rate paper propos hierarch partit approach partit larg graph subgraph repeatedli top fashion uniqu featur approach comput hop cover partit iter top partit provid techniqu comput hop cover connect subgraph cover comput cut graph subgraph result cover high compress entir graph approach propos node orient approach edg orient approach approach effici comput hop cover larg graph high compress rate extens experi studi show hop cover graph node billion connect obtain minut compress rate pc find time ddepend shortest path larg graph detect shape anomali probabilist approach hidden markov model pattern match cloak time seri hierarch index approach support xpath queri multipl materi view select xpath queri rewrit abstract studi problem answer xpath queri multipl materi view effort answer queri singl materi view answer queri multipl view remain address import aspect problem multipl view select equival multipl view rewrit problem propos nfa base approach call vfilter filter view answer queri present criterion multipl view queri answer base output vfilter propos heurist method identifi minim view set answer queri problem multipl view rewrit refin materi fragment select view push select join refin fragment util encod scheme final extract result queri materi fragment singl view experi show effici approach fast graph pattern match spot signific chang subgraph evolv graph respons time constrain top dk queri evalu sensor network monitor aggreg dnn object road network contain rewrit xpath queri view revisit integr multipl data sourc stock predict maxim subspac coregul gene cluster abstract cluster popular techniqu analyz microarrai data set gene experiment condit explor biologist real identifi coregul gene cluster includ posit neg regul gene cluster exist pattern base tendenc base cluster approach directli appli find coregul gene cluster design find posit regul gene cluster paper order cluster coregul gene propos code scheme cluster gene cluster code gene code posit neg regul base code scheme propos algorithm find maxim subspac coregul gene cluster prune techniqu maxim subspac coregul gene cluster cluster set gene condit sequenc cluster includ subspac coregul gene cluster conduct extens experiment studi approach effect effici find maxim subspac coregul gene cluster addit approach outperform exist approach find posit regul gene cluster index term gene express data cluster coregul gene cluster safeti domain independ translat complex databas queri slide dwindow top dk queri uncertain stream queri process uncertain data stream attract lot attent due imprecis natur data gener varieti stream applic read sensor network exist work uncertain data stream studi unbound stream paper take step import challeng problem answer slide window queri uncertain data stream focu arguabl import type queri top queri challeng answer slide window top queri uncertain data stream stem strict space time requir process arriv expir tupl high speed stream combin difficulti cope exponenti blowup number world induc uncertain data model paper design unifi framework process slide window top queri uncertain stream show exist top definit literatur plug framework result succinct synops space smaller window size highli effici term process time addit theoret space time bound prove synops present experiment report verifi practic effici synthet real data tame verif hard effici algorithm test subgraph isomorph graph wide model complic data semant applic paper aim develop effici techniqu retriev graph queri graph larg set graph problem test subgraph isomorph gener np hard exist techniqu base framework filter verif reduc precis comput cost featur base index develop exist techniqu work small queri graph verif phase bottleneck queri graph size increas motiv paper firstli propos effici algorithm test subgraph isomorph quicksi develop featur base index techniqu accommod quicksi filter phase extens experi real synthet data demonstr effici scalabl propos techniqu significantli improv exist techniqu data mine proxi approach effici frequent itemset mine fast frequent free tree mine graph databas advanc data web manag cost dbase queri optim multi reachabl join mine close frequent free tree graph databas similar match high speed time dseri stream summar order statist data stream duplic rank queri essenti find data element rank monoton order data element rank queri equival variat find top dk min dcost connect tree databas exist keyword search system relat databas requir user submit complet queri comput answer user feel left dark limit knowledg data method modifi queri find answer paper propos approach keyword search relat world call tastier tastier system bring instant gratif user support type ahead search find answer fly user type queri keyword main challeng achiev high interact speed larg amount data multipl tabl queri answer effici millisecond propos effici index structur algorithm find relev answer fly join tupl databas devis partit base method improv queri perform group relev tupl prune irrelev tupl effici develop techniqu answer queri effici predict highli relev complet queri user conduct experiment evalu propos techniqu real data set demonstr effici practic search paradigm logic dbase approach mine induct databas time ddepend event hierarchi construct index pla effici similar search similar base search time seri databas hot research topic long histori wide applic includ multimedia retriev data mine web search retriev due high dimension length time seri similar search directli index time seri encount problem dimension curs dimension reduct techniqu propos break curs reduc dimension time seri propos method piecewis linear approxim pla index mechan support similar queri prevent effici search larg timeseri databas initi studi effect reduct method show pla perform wors motiv paper investig pla approxim index time seri specif propos distanc function reduc pla space prove function result lower bound euclidean distanc origin time seri lead fals dismiss similar search step develop effect approach index lower bound improv search effici extens experi wide spectrum real synthet data set demonstr effici effect pla newli propos lower bound distanc term prune power wall clock time compar stateof art reduct method adapt piecewis constant approxim apca chebyshev polynomi cp graph index tree delta grap tree pattern queri rewrit view adapt schedul share window join data stream cfp dtree compact disk dbase structur store queri frequent itemset dimension reduct algorithm applic interact visual advanc web dage inform manag databas xml technolog paper report experi develop erx data manag system system devis collect data come xml data sourc store databas independ sourc format queri languag name erx ql queri databas gener xml document develop erx data manag system explor possibl integr basic technolog relat dbm java xslt unifi framework make system interoper adopt technolog relat object orient databas technolog framework base entiti relationship data model erx ti specif technic commerci solut fast reachabl queri process fast structur join locat function fast comput reachabl label larg graph numer applic deal larg graph queri reachabl node graph hop cover compactli repres edg transit closur graph space answer reachabl queri effici challeng comput hop cover exist approach suffer larg resourc consumpt low compress rate paper propos hierarch partit approach partit larg graph subgraph repeatedli top fashion uniqu featur approach comput hop cover partit iter top partit provid techniqu comput hop cover connect subgraph cover comput cut graph subgraph result cover high compress entir graph approach propos node orient approach edg orient approach approach effici comput hop cover larg graph high compress rate extens experi studi show hop cover graph node billion connect obtain minut compress rate pc dual label answer graph reachabl queri constant time graph reachabl fundament wide rang applic includ xml index geograph navig internet rout ontolog queri base rdf owl applic involv huge graph requir fast answer reachabl queri reachabl label method propos purpos assign label vertic reachabl vertic decid label spars graph hop base reachabl label scheme answer reachabl queri effici small label space label process time consum practic larg graph paper propos label scheme spars graph scheme ensur graph reachabl queri answer constant time spars graph complex label process linear make algorithm applic massiv dataset analyt experiment result show approach effici stateof art approach label method altern scheme tradeoff queri time label space benefit applic tree graph fast frequent free tree mine graph databas suppress model overfit mine concept ddrift data stream frequenc decis maker make decis nuit user interfac effici keyword search databas integr databas inform retriev techniqu user wide rang high qualiti servic present prototyp system call nuit effici process keyword queri top relat multidimension subspac skylin analysi skylin oper import multicriteria decis make applic recent studi develop effici method comput skylin object space consid skylin multipl subspac simultan importantli fundament text classif neg exampl revisit approxim process massiv continu quantil queri high dspeed data stream fals neg approach mine frequent itemset high speed transact data stream effici comput dmedian data stream memori constraint find centric local outlier categor fnumer space answer xml queri path dbase index survei web technolog research develop apweb fals dneg frequent item mine data stream burst acceler xml structur join partit text classif label neg document win effcient data placement strategi parallel xml databas locat motif time dseri data problem locat motif real valu multivari time seri data involv discoveri set recur pattern embed time seri set compos overlap subsequ constitut motif includ subsequ similar abil automat discov motif intellig system form endogen meaning represent environ unsupervis sensor analysi paper formul unifi view motif discoveri problem locat region high densiti space time seri subsequ approach effici quadrat length data requir fewer user paramet previou method natur variabl length motif occurr nonlinear tempor warp evalu perform approach data set domain includ bodi inerti sensor speech paramet free bursti event detect text stream effici comput skylin cube skylin propos import oper multi criteria decis make data mine visual user prefer queri paper problem effici comput skycub consist skylin empti subset set dimens exist skylin comput algorithm immedi extend comput skylin queri independ share algorithm ineffici develop comput share strategi base ectiv identifi comput depend multipl relat skylin queri base share strategi algorithm bottom top algorithm propos comput skycub effici final extens perform evalu confirm effect share strategi queri translat xpath sql presenc recurs dtd interact recurs xpath recurs dtd make challeng answer xpath queri xml data store rdbm schema base shred present approach translat xpath queri sql queri simpl fixpoint lfp oper support commerci rdbm approach base algorithm rewrit xpath queri regular xpath express capabl captur dtd recurs xpath queri uniform framework provid algorithm translat regular xpath queri sql queri lfp optim techniqu minim lfp oper similar search implicit object featur abstract driven real applic paper studi problem similar search implicit object featur featur object pre comput evalu exist similar search techniqu applic effici algorithm develop paper approach problem tree base algorithm consist step featur evalu similar search perform evalu demonstr algorithm effici larg spatial dataset identifi interest pattern multidatabas make differ benchmark xml databas implement predict power textual inform financi market mine textual document time seri concurr predict movement stock price base content new stori emerg topic data mine commun previou research shown strong relationship time new stori releas time stock price fluctuat paper propos systemat framework predict tertiari movement stock price analyz impact new stori stock specif investig impact new stori stock base effici market hypothesi data mine text mine techniqu extens experi real life data conduct encourag result obtain identifi interest custom web log classif construct suffix tree gigabyt sequenc megabyt memori divid dand dapproxim constraint push strategi iceberg cube mine algebra equival nest relat oper dynam updat xml data number scheme revisit advanc web technolog applic scalabl sequenti pattern mine biolog sequenc continu maintain quantil summari recent element data stream statist recent observ data element requir applic involv data stream intrus detect network monitor stock price predict financi market web log mine access predict user click stream mine person statist comput quantil summari challeng complex paper studi problem continu maintain quantil summari recent observ element stream quantil queri answer guarante precis develop space effici algorithm pre defin requir scan input data stream log space worst case develop algorithm maintain quantil summari recent element quantil queri recent element answer guarante precis worst case space requir algorithm log perform studi actual quantil estim error guarante precis space requir theoret bound classifi text stream presenc concept drift data mine proxi serv larg number user effici frequent itemset mine fals posit fals neg mine frequent itemset high speed transact data stream bloom histogram path select estim xml data updat cost base xml queri optim call accur estim select path express interact internet applic benefit estim number estim techniqu propos literatur guarante estim accuraci space limit addit assum xml data static updat paper present framework xml path select estim dynam context specif propos data structur bloom histogram approxim xml path frequenc distribut small space budget estim path select accur bloom histogram obtain upper bound estim error discuss trade off accuraci space limit support updat bloom histogram effici underli xml data chang dynam summari layer exact detail xml path inform demonstr extens experi solut simpl effect dynam materi view cach mine frequent item spatio dtempor databas mine depend pattern probabilist databas effici mine frequent pattern ascend frequenc order prefix dtree effici strategi mine except multi ddatabas select view mainten cost constraint issu order effici support larg number line analyt process olap queri data warehous precomput materialis olap queri import issu select set materialis view order minimis total process cost olap queri mainten cost view select problem select set materialis view mainten cost constraint mainten time order minimis total queri process cost set queri problem difficult view select problem disk space constraint select view make previous select view benefici due fact total mainten cost set view decreas view materialis mainten cost increas disk space constraint problem recent receiv signific attent greedi heurist algorithm propos qualiti greedi heurist algorithm analys paper multidimension data warehous environ reexamin greedi heurist algorithm set provid user insight qualiti heurist algorithm ac classif databas manag effici effect xml tool techniqu data integr web dtree dynam multidimension index metric space dynam materi view manag base predic dynam maintain frequent item data stream challeng maintain frequent item data stream small bound memori dynam environ insert delet item allow paper propos algorithm call hcount handl insert delet item memori space report algorithm algorithm superior term precis recal process time addit approach request preknowledg size rang data stream handl rang extens dynam modif algorithm hcount improv hcount own significantli perform effici interact dalgorithm prune power materi view select revisit pathguid effici cluster base index method xml path express ascend frequenc order prefix dtree effici mine frequent pattern afopt effici implement pattern growth approach paper revisit frequent itemset mine fim problem focu studi pattern growth approach exist pattern growth algorithm differ dimens item search order condit databas represent condit databas construct strategi tree travers strategi adopt strategi dimens adapt algorithm propos find good strategi gener situat paper implement techniqu adapt pattern growth algorithm call afopt demonstr good perform test dataset extend algorithm mine close maxim frequent itemset comprehens experi conduct demonstr effici propos algorithm push aggreg constraint divid dand dapproxim iceberg cube mine comput group partit group dimens list satisfi aggreg constraint previou work push anti monoton constraint iceberg cube mine constraint anti monoton paper propos strategi push gener aggreg constraint call divid approxim strategi divid search space approxim constraint subspac pushabl constraint strategi recurs appli approxim approach constraint prune tight show constraint defin sql aggreg arithmet oper comparison oper push divideand approxim present effici implement import subclass evalu synthet real life databas pbitre code effici process contain join paper address issu relat contain join process tree structur data xml document contain join take set xml node element input return pair element contain relationship hold previou algorithm process contain join requir element set sort index paper propos complet contain queri process framework base code scheme pbitre code pbitre code determin ancestor descend relationship element pbitre base code effici present algorithm framework optim combin set newli propos partit base algorithm process contain join effici sort index experiment result contain join process algorithm base propos code scheme outperform exist algorithm significantli make differ benchmark xml databas implement effect schema dbase xml queri optim techniqu path express common featur xml queri languag evalu method path express queri propos recent research issu optim regular path express queri paper kind path express optim principl propos name path shorten path complement path shorten principl reduc queri cost shorten path express knowledg xml schema path complement principl substitut user queri equival lower cost path express experiment result show techniqu larg improv perform path express queri process comput store queri frequent pattern hot hypergraph dbase outlier test categor data wide data mine techniqu outlier detect process aim find anomali good explan exist method design numer data meet problem real life applic categor data mine classif correspond trace studi problem mine classif characterist data classifi repres previou knowledg classif characterist data find classif characterist data member larg famili longer shop frequent find kind hold kei organ adopt chang environ stai ahead competitor challeng difficult chang compar classifi larg paper propos techniqu identifi idea trace characterist classifi correspond classifi exampl describ wai present user focu small number import evalu propos method real life data set contain join size estim model method holist twig join index xml document find occurr twig pattern select predic multipl element xml document core oper cient evalu xml queri holist twig join algorithm propos recent optim solut twig pattern involv ancestordescend relationship paper address problem cient process holist twig join partli index xml document propos algorithm util indic element set shown analyt propos algorithm cient exist state art algorithm term worst case cpu cost experiment result dataset propos index base algorithm perform significantli exist binari structur join twig pattern vari join select classifi high dspeed text stream recent class data intens applic wide recogn data model transient open end stream persist tabl disk lead surg research interest call data stream report work concentr structur data bit sequenc seldom focu unstructur data textual document paper propos cient classif approach classifi highspe text stream propos approach base sketch classifi stream cientli scan consum small bound memori model mainten oper extens experi benchmark real life new articl collect conduct encourag result propos approach highli feasibl ud dindex effici approxim index xml data automata match xml queri process approach fulli dynam partit handl data skew parallel data cube comput materi view select constrain evolutionari optim statist estim access frequenc problem path materi revisit effici storag model xml data xml emerg major standard repres data world wide web xml storag model propos store xml data databas manag system uniqu featur model map base approach dtd inform requir xml data storag paper present modelmap base storag model call xparent unlik exist work model map base approach emphas convert xml document databas schema translat xml queri sql queri paper focu ectiv storag model term queri process studi kei issu affect queri perform storag schema design store xml data multipl tabl path materi store path inform databas show similar di erent storag model significantli ect queri perform perform studi conduct data set queri set experiment result present path express comput approach xml data parallel mainten materi view person comput cluster condens cube effici approach reduc data cube size xparent effici rdbm dbase xml databas system discrimin categori match effici text classif huge document collect path tree frequent pattern framework mine frequent pattern paper propos framework mine frequent pattern larg transact databas core framework code prefix path tree represent memori base prefixpath tree disk base prefix path tree disk base prefix path tree simpl data structur rich inform contain small size memorybas prefix path tree simpl compact memori base prefix path tree depth frequent pattern discoveri algorithm call mine propos paper outperform fp growth significantli memori base prefix path tree store disk disk base prefix path tree assist code scheme present effici load algorithm load minim requir disk base prefix path tree main memori techniqu push constraint load process studi new sensit stock trend predict perform evalu dom dbase xml databas storag differ heurist make mainten dcost view dselect revisit structur map index effici xml path express process templat model multidimension inter dtransact associ rule multi dcube comput comput attribut datacub requir comput aggreg function group gener interrel group by paper focu multi cube comput extend algorithm singl datacub comput process multipl datacub simultan issu intend explor memori util propos multi cube algorithm sort base algorithm hash base algorithm data skew sparsiti investig result extens perform studi report pattern discoveri base time dseri decomposit revisit view mainten data warehous support ir queri refin partial keyword set approxim graph schema extract semi dstructur data maintain materi view data warehous multipl remot sourc mb tree dynam updat metric index similar search optim multipl dimension queri simultan multidimension databas multi dimension express mdx provid interfac relat olap queri simultan interest problem optim execut mdx queri data warehous maintain set redund materi view acceler olap oper number greedi approxim algorithm propos version problem paper evalu experiment perform apb tpc benchmark conclud scale realist workload motiv fact develop greedi algorithm algorithm construct execut plan top manner identifi step benefici view find promis queri show extens experiment method outperform exist case statist estim access frequenc data broadcast environ object placement parallel oodbm mine inter dtransact associ templat multi dimension inter transact associ rule extend tradit associ rule describ gener associ item multipl properti cross transact mcdonald burger king open branch kfc open branch month mile rule number potenti inter transact associ rule extrem larg mine inter transact associ pose challeng effici process mine intra transact associ order make associ mine practic computation tractabl studi present templat model user declar interest inter transact associ mine guidanc templat optim techniqu devis speed discoveri inter transact associ rule show seri experi optim techniqu yield significa hash place memori shift datacub comput revisit safe databas queri extern function support rang queri wireless environ nonuniform broadcast stem rule refin document retriev queri data mine approach queri refin perform studi mobil tcp fip solut gener broadcast program support rang queri break workahol energi deffici select tune mechan demand ddriven dbase wireless environ analysi select tune scheme nonuniform broadcast dynam schedul infinit air dcach balanc workload highli mobil environ describ complet factor tenth eleventh fermat number tenth fermat number product prime factor decim digit eleventh fermat number product prime factor decim digit note decim digit factor thirteenth fermat number number prime factor decim digit composit factor factor report found ellipt curv method ecm digit factor tenth fermat number found mflop year comput discuss aspect practic implement ecm includ special purpos hardwar note larg factor found recent ecm introduct nonneg integ fermat number prime composit factor schedul issu partit tempor join matric aris solut signal process problem special displac structur adapt filter direct arriv estim yield matric toeplitz type recent method gohberg kailath olshevski gko fast gaussian elimin partial pivot structur matric paper round error analysi perform cauchi toeplitz variant gko method shown error growth depend growth auxiliari vector gener comput gko algorithm shown circumst growth gener larg error growth larger encount normal gaussian elimin partial pivot modif algorithm perform type row column pivot propos amelior problem keyword structur matric fast algorithm displac rank translat complex calculu queri arithmat oper energi effici filter nonuniform broadcast perform studi declust strategi parallel spatial databas spatial join strategi distribut spatial dbm guidelin implement access method modul extens dbm modu lru ds buffer alloc approach oodbm decomposit approach optim queri includ adt function integr function data model program environ applic solid databas databas support solid model 